On Arch Factorization and Subword Universality for Words and Compressed Words

نویسندگان

چکیده

Using arch-jumping functions and properties of the arch factorization words, we propose a new algorithm for computing subword circular universality index words. We also introduce signature that leads to simple algorithms indexes SLP-compressed

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subword Metrics for Infinite Words

The space of one-sided infinite words plays a crucial rôle in several parts of Theoretical Computer Science. Usually, it is convenient to regard this space as a metric space, the Cantor-space. It turned out that for several purposes topologies other than the one of the Cantor-space are useful, e.g. for studying fragments of first-order logic over infinite words or for a topological characterisa...

متن کامل

On Minimal Words With Given Subword Complexity

We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fibonacci number defined by F1 = F2 = 1 and Fn = Fn−1 + Fn−2 for n > 2. We also give an algorithm that generates a minimal word Sn for each n ≥ 1. 1991 Mathematics Subject Classification: Primary 68R15; Secondary 05C35. 0 In...

متن کامل

Word Problems on Compressed Words

Motivation In general, computational problems become harder, when inputs are represented in a compressed form. Motivation In general, computational problems become harder, when inputs are represented in a compressed form. • Develop efficient algorithms on compressed data (strings, trees, pictures) that operate directly on compressed data without decompressing them first. • Prove lower bounds on...

متن کامل

On z-factorization and c-factorization of standard episturmian words

Ziv-Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian words. Thus the previously known c-factorization of standard Sturmian words is provided as a special case. Moreover, the two factorizations are compared.

متن کامل

lexical decomposition awareness and its effect on delayed receptive and productive recognition and recall of vocabulary knowledge of morphologically complex english words: an iranian efl context

abstract lexical knowledge of complex english words is an important part of language skills and crucial for fluent language use (nation, 2001). the present study, thus, was an attempt to assess the role of morphological decomposition awareness as a vocabulary learning strategy on learners’ productive and receptive recall and recognition of complex english words. so 90 sophomores (female and ma...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-33180-0_21